Exact model reduction of combinatorial reaction networks
نویسندگان
چکیده
منابع مشابه
Model reduction of biochemical reaction networks by tropical analysis methods
We discuss a method of approximate model reduction for networks of biochemical reactions. This method can be applied to networks with polynomial or rational reaction rates and whose parameters are given by their orders of magnitude. In order to obtain reduced models we solve the problem of tropical equilibration that is a system of equations in max-plus algebra. In the case of networks with non...
متن کاملReduction of multiscale stochastic biochemical reaction networks using exact moment derivation
Biochemical reaction networks (BRNs) in a cell frequently consist of reactions with disparate timescales. The stochastic simulations of such multiscale BRNs are prohibitively slow due to high computational cost for the simulations of fast reactions. One way to resolve this problem uses the fact that fast species regulated by fast reactions quickly equilibrate to their stationary distribution wh...
متن کاملExact Fluid Lumpability for Chemical Reaction Networks
We present a technique for the automatic reduction of chemical reaction networks (CRNs). We study exact fluid lumpability, a partition of species satisfying the dynamical property that species in the same block have the same output at all times if initialized equally. Inspired by analogous approaches in traditional models of computation such as labelled transition systems, we characterize this ...
متن کاملMarkov chain aggregation and its applications to combinatorial reaction networks
We consider a continuous-time Markov chain (CTMC) whose state space is partitioned into aggregates, and each aggregate is assigned a probability measure. A sufficient condition for defining a CTMC over the aggregates is presented as a variant of weak lumpability, which also characterizes that the measure over the original process can be recovered from that of the aggregated one. We show how the...
متن کاملA Combinatorial Model for Series - Parallel Networks
The category of pregeometries with basepoint is defined and explored. In this category two important operations are extensively characterized: the series connection S(G, H), and the parallel connection P(G, H) = S(G, H); and the latter is shown to be the categorical direct sum. For graphical pregeometries, these notions coincide with the classical definitions. A pregeometry Fis a nontrivial ser...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Systems Biology
سال: 2008
ISSN: 1752-0509
DOI: 10.1186/1752-0509-2-78